Analytical Reduction Method for New Type-2 Fuzzy Chance-Constrained Portfolio Selection Model
نویسندگان
چکیده
منابع مشابه
Chance-constrained Portfolio Selection with Birandom Returns
The aim of this paper is to solve the portfolio problem when security returns are birandom variables. Two types of portfolio selection based on chance measure are provided according to birandom theory. Since the proposed optimization problems are difficult to solve by traditional methods, a hybrid intelligent algorithm by integrating birandom simulation and genetic algorithm is designed. Finall...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملA Fuzzy Goal Programming Model for Efficient Portfolio Selection.
This paper considers a multi-objective portfolio selection problem imposed by gaining of portfolio, divided yield and risk control in an ambiguous investment environment, in which the return and risk are characterized by probabilistic numbers. Based on the theory of possibility, a new multi-objective portfolio optimization model with gaining of portfolio, divided yield and risk control is propo...
متن کاملsome properties for fuzzy chance constrained programming
convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...
متن کاملComputational study of a chance constrained portfolio selection problem
We study approximations of chance constrained problems. In particular, we consider the Sample Average Approximation (SAA) approach and discuss convergence properties of the resulting problem. A method for constructing bounds for the optimal value of the considered problem is discussed and we suggest how one should tune the underlying parameters to obtain a good approximation of the true problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2021
ISSN: 1875-6883
DOI: 10.2991/ijcis.d.210507.001